QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems

نویسندگان

چکیده

In this article, we aim to solve high-dimensional convex quadratic programming (QP) problems with a large number of terms, linear equality, and inequality constraints. To the targeted QP problem desired accuracy efficiently, consider restricted-Wolfe dual develop two-phase Proximal Augmented Lagrangian method (QPPAL), Phase I generate reasonably good initial point warm start II obtain an accurate solution efficiently. More specifically, in I, based on recently developed symmetric Gauss-Seidel (sGS) decomposition technique, design novel sGS-based semi-proximal augmented for purpose finding low medium accuracy. Then, II, proximal algorithm is proposed more Extensive numerical results evaluating performance QPPAL against existing state-of-the-art solvers Gurobi, OSQP, QPALM are presented demonstrate high efficiency robustness our solving various classes large-scale problems. The MATLAB implementation software package available at https://blog.nus.edu.sg/mattohkc/softwares/qppal/ .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations

In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...

متن کامل

An Augmented Lagrangian Method for Conic Convex Programming

We propose a new first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min { ρ(x) + γ(x) : Ax− b ∈ K, x ∈ χ } , where ρ : Rn → R ∪ {+∞}, γ : Rn → R are closed, convex functions, and γ has a Lipschitz continuous gradient, A ∈ Rm×n, K ⊂ Rm is a closed convex cone, and χ ⊂ dom(ρ) is a “simple” convex compact set such that optimization problems of the form mi...

متن کامل

A Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems

In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...

متن کامل

Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs

We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian function and provide an estimate of the optimal active set. In the second phase, an equalityconstrained QP defined by the current inactive variables is approximately minimized in order to generate a second-order sear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Mathematical Software

سال: 2022

ISSN: ['0098-3500', '1557-7295']

DOI: https://doi.org/10.1145/3476571